Complexity Analysis of ATR Algorithms Based on Invariants
نویسندگان
چکیده
Recent research in the calculation and exploitation of geometric object/image relations suggests new approaches to automatic target recognition (ATR). The resulting conceptual advances have efficiently solved the geometry problem and have transformed the ATR problem into a correspondence problem. This paper provides an analysis of the elementary algorithms which exploit object/image relations as a basis for object recognition. The goal is to develop an understanding for the critical components to address for developing a practical system.
منابع مشابه
New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل2 Time - Complexity Semantics for Feasible Affine Recursions
The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-deenable (ATR types are connned to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursio...
متن کاملImage Complexity Metrics for Automatic Target Recognizers
Designers of automatic target recognizers (ATR) need measures of image complexity to compare the performance of different ATRs. An image complexity metric should provide an a priori estimate of the difficulty of locating a true target in an image. An ideal image metric is a mapping from the set of all images to a finite real interval. The extrema of the interval indicate extrema in difficulty. ...
متن کامل